Axioms for Probability and Nondeterminism

نویسندگان

  • Michael W. Mislove
  • Joël Ouaknine
  • James Worrell
چکیده

This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. We present a domain model and an operational semantics for our calculus. The denotational model uses the probabilistic powerdomain of Jones and Plotkin, combined with a geometrically convex variant of the Plotkin powerdomain. The operational model defines transition rules under which a process makes transitions to probability distributions over states. We prove a full abstraction result that shows two processes have the same denotation if and only if they are probabilistically bisimilar. We also show that the expected laws for probability and nondeterminism are sound and complete with respect to the denotational model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game Theory in Formal Verification Scribe Notes for Lecture 8 Markov Decision Processes

Simple Stochastic Game nondeterminism nondeterminism probability probability nondeterminism nondeterminism probability 1 Definitions Markov Chain (MC) Definition 1. A Markov Chain ((S, E), δ) is a graph (S, E) with a function δ : S → D(S) that maps every state to a probability distribution of successor states. There is an edge between two states s, t in S iff the probability of going from s to ...

متن کامل

BASES AND CIRCUITS OF FUZZIFYING MATROIDS

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...

متن کامل

Probability and Nondeterminism in Operational Models of Concurrency

We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our survey is carried out from the perspective of probabilistic automata, a model originally developed for the analysis of randomized distributed algorithms.

متن کامل

Strong Local Nondeterminism and Sample Path Properties of Gaussian Random Fields

Sufficient conditions for a real-valued Gaussian random field X = {X(t), t ∈ RN} with stationary increments to be strongly locally nondeterministic are proven. As applications, small ball probability estimates, Hausdorff measure of the sample paths, sharp Hölder conditions and tail probability estimates for the local times of Gaussian random fields are established. Running head: Strong Local No...

متن کامل

Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams

Nondeterminism in specifications may be used for at least two different purposes. One is to express underspecification, which means that the specifier for the same environment behavior allows several alternative behaviors of the specified component and leaves the choice between these to those responsible for implementing the specification. In this case a valid implementation will need to implem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 96  شماره 

صفحات  -

تاریخ انتشار 2004